A Prefix Tree-Based Algorithm for Efficient Discovery of Frequent Patterns
نویسندگان
چکیده
Mining frequent patterns from a large database often involves construction of intermediate structures such as trees for the purpose of efficiency. Various researchers have proposed many types of trees such as CATS-tree and Can-tree. However, these tree-based mining algorithms require a large amount of computing time during the tree construction phase or need generation of extra trees. In this paper, we propose a prefix tree-based mining algorithm which does not require extra tree construction and can reduce the number of potential data exchanges during the intermediate tree contruction. We demonstrate the effectiveness of our algorithm and performance improvement over the existing approach by a series of experiments.
منابع مشابه
From Path Tree To Frequent Patterns: A Framework for Mining Frequent Patterns
In this paper, we propose a new framework for mining frequent patterns from large transactional databases. The core of the framework is of a novel coded prefix-path tree with two representations, namely, a memory-based prefixpath tree and a disk-based prefix-path tree. The disk-based prefix-path tree is simple in its data structure yet rich in information contained, and is small in size. The me...
متن کاملCT-ITL : Efficient Frequent Item Set Mining Using a Compressed Prefix Tree with Pattern Growth
Discovering association rules that identify relationships among sets of items is an important problem in data mining. Finding frequent item sets is computationally the most expensive step in association rule discovery and therefore it has attracted significant research attention. In this paper, we present a more efficient algorithm for mining complete sets of frequent item sets. In designing ou...
متن کاملFSMTree: An Efficient Algorithm for Mining Frequent Temporal Patterns
Research in the field of knowledge discovery from temporal data recently focused on a new type of data: interval sequences. In contrast to event sequences interval sequences contain labeled events with a temporal extension. Mining frequent temporal patterns from interval sequences proved to be a valuable tool for generating knowledge in the automotive business. In this paper we propose a new al...
متن کاملEfficient Weighted Frequent Patterns Mining over Evolving Dataset
Weighted frequent pattern mining is suggested to find out more important frequent pattern by considering different weights of each item. Weighted Frequent Patterns are generated in weight ascending and frequency descending order by using prefix tree structure. These generated weighted frequent patterns are applied to maximal frequent item set mining algorithm. Maximal frequent pattern mining ca...
متن کاملAn Efficient Algorithm for Enumerating Closed Patterns in Transaction Databases
The class of closed patterns is a well known condensed representations of frequent patterns, and have recently attracted considerable interest. In this paper, we propose an efficient algorithm LCM (Linear time Closed pattern Miner) for mining frequent closed patterns from large transaction databases. The main theoretical contribution is our proposed prefix-preserving closure extension of closed...
متن کامل